<!-- This comment will put IE 6, 7 and 8 in quirks mode -->
<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<title>shark::TreeConstruction Class Reference</title>
<script type="text/javaScript" src="search/search.js"></script>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<script src="https://polyfill.io/v3/polyfill.min.js?features=es6"></script>
<script id="MathJax-script" async src="https://cdn.jsdelivr.net/npm/mathjax@3.0.1/es5/tex-mml-chtml.js"></script>
<script src="../../mlstyle.js"></script>
<link href="../css/besser.css" rel="stylesheet" type="text/css"/>
</head>
<!-- pretty cool: each body gets an id tag which is the basename of the web page  -->
<!--              and allows for page-specific CSS. this is client-side scripted, -->
<!--              so the id will not yet show up in the served source code -->
<script type="text/javascript">
    jQuery(document).ready(function () {
        var url = jQuery(location).attr('href');
        var pname = url.substr(url.lastIndexOf("/")+1, url.lastIndexOf(".")-url.lastIndexOf("/")-1);
        jQuery('#this_url').html('<strong>' + pname + '</strong>');
        jQuery('body').attr('id', pname);
    });
</script>
<body>
    <div id="shark_old">
        <div id="wrap">
            <div id="header">
                <div id="site-name"><a href="../../sphinx_pages/build/html/index.html">Shark machine learning library</a></div>
                <ul id="nav">
                    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/installation.html">Installation</a>
                    </li>
		    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/tutorials/tutorials.html">Tutorials</a>
                    </li>
		    <li >
                        <a href="../../sphinx_pages/build/html/rest_sources/benchmark.html">Benchmarks</a>
                    </li>
                    <li class="active">
                        <a href="classes.html">Documentation</a>
                        <ul>
                            <li class="first"></li>
                            <li><a href="../../sphinx_pages/build/html/rest_sources/quickref/quickref.html">Quick references</a></li>
                            <li><a href="classes.html">Class list</a></li>
                            <li class="last"><a href="group__shark__globals.html">Global functions</a></li>
                        </ul>
                    </li>
                </ul>
            </div>
        </div>
    </div>
<div id="doxywrapper">
<!--
    <div id="global_doxytitle">Doxygen<br>Documentation:</div>
-->
    <div id="navrow_wrapper">
<!-- Generated by Doxygen 1.9.8 -->
<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="namespaceshark.html">shark</a></li><li class="navelem"><a class="el" href="classshark_1_1_tree_construction.html">TreeConstruction</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="summary">
<a href="classshark_1_1_tree_construction-members.html">List of all members</a> &#124;
<a href="#pub-methods">Public Member Functions</a> &#124;
<a href="#pro-attribs">Protected Attributes</a>  </div>
  <div class="headertitle"><div class="title">shark::TreeConstruction Class Reference<div class="ingroups"><a class="el" href="group__models.html">Models</a> &raquo; <a class="el" href="group__space__trees.html">Space Partitioning Trees</a></div></div></div>
</div><!--header-->
<div class="contents">

<p>Stopping criteria for tree construction.  
 <a href="classshark_1_1_tree_construction.html#details">More...</a></p>

<p><code>#include &lt;<a class="el" href="_binary_tree_8h_source.html">shark/Models/Trees/BinaryTree.h</a>&gt;</code></p>
<table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pub-methods" name="pub-methods"></a>
Public Member Functions</h2></td></tr>
<tr class="memitem:a59a1339479147eec5ea8c780a4cf6ddc" id="r_a59a1339479147eec5ea8c780a4cf6ddc"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_tree_construction.html#a59a1339479147eec5ea8c780a4cf6ddc">TreeConstruction</a> ()</td></tr>
<tr class="memdesc:a59a1339479147eec5ea8c780a4cf6ddc"><td class="mdescLeft">&#160;</td><td class="mdescRight">Default constructor: only stop at trivial leaves.  <br /></td></tr>
<tr class="separator:a59a1339479147eec5ea8c780a4cf6ddc"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:ab58da7392a7140a4a51302ab34815172" id="r_ab58da7392a7140a4a51302ab34815172"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_tree_construction.html#ab58da7392a7140a4a51302ab34815172">TreeConstruction</a> (<a class="el" href="classshark_1_1_tree_construction.html">TreeConstruction</a> const &amp;other)</td></tr>
<tr class="memdesc:ab58da7392a7140a4a51302ab34815172"><td class="mdescLeft">&#160;</td><td class="mdescRight">Copy constructor.  <br /></td></tr>
<tr class="separator:ab58da7392a7140a4a51302ab34815172"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:adbbd4f3b18ceca7fa693f166a3066daf" id="r_adbbd4f3b18ceca7fa693f166a3066daf"><td class="memItemLeft" align="right" valign="top">&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_tree_construction.html#adbbd4f3b18ceca7fa693f166a3066daf">TreeConstruction</a> (unsigned int <a class="el" href="classshark_1_1_tree_construction.html#abb2b42865b60ddf110e4915ab6457373">maxDepth</a>, unsigned int <a class="el" href="classshark_1_1_tree_construction.html#aa1b255097aa1e7101783b1300b921aad">maxBucketSize</a>)</td></tr>
<tr class="memdesc:adbbd4f3b18ceca7fa693f166a3066daf"><td class="mdescLeft">&#160;</td><td class="mdescRight">Constructor.  <br /></td></tr>
<tr class="separator:adbbd4f3b18ceca7fa693f166a3066daf"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa76f09fabb33889421b6c8f2771afb8a" id="r_aa76f09fabb33889421b6c8f2771afb8a"><td class="memItemLeft" align="right" valign="top"><a class="el" href="classshark_1_1_tree_construction.html">TreeConstruction</a>&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_tree_construction.html#aa76f09fabb33889421b6c8f2771afb8a">nextDepthLevel</a> () const</td></tr>
<tr class="memdesc:aa76f09fabb33889421b6c8f2771afb8a"><td class="mdescLeft">&#160;</td><td class="mdescRight">return a <a class="el" href="classshark_1_1_tree_construction.html" title="Stopping criteria for tree construction.">TreeConstruction</a> object with maxDepth reduced by one  <br /></td></tr>
<tr class="separator:aa76f09fabb33889421b6c8f2771afb8a"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:abb2b42865b60ddf110e4915ab6457373" id="r_abb2b42865b60ddf110e4915ab6457373"><td class="memItemLeft" align="right" valign="top">unsigned int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_tree_construction.html#abb2b42865b60ddf110e4915ab6457373">maxDepth</a> () const</td></tr>
<tr class="memdesc:abb2b42865b60ddf110e4915ab6457373"><td class="mdescLeft">&#160;</td><td class="mdescRight">return maximum depth of the tree  <br /></td></tr>
<tr class="separator:abb2b42865b60ddf110e4915ab6457373"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:aa1b255097aa1e7101783b1300b921aad" id="r_aa1b255097aa1e7101783b1300b921aad"><td class="memItemLeft" align="right" valign="top">unsigned int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_tree_construction.html#aa1b255097aa1e7101783b1300b921aad">maxBucketSize</a> () const</td></tr>
<tr class="memdesc:aa1b255097aa1e7101783b1300b921aad"><td class="mdescLeft">&#160;</td><td class="mdescRight">return maximum "size" of a leaf node  <br /></td></tr>
<tr class="separator:aa1b255097aa1e7101783b1300b921aad"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table><table class="memberdecls">
<tr class="heading"><td colspan="2"><h2 class="groupheader"><a id="pro-attribs" name="pro-attribs"></a>
Protected Attributes</h2></td></tr>
<tr class="memitem:a4631c3ae5ba78df8b954963e4be22e45" id="r_a4631c3ae5ba78df8b954963e4be22e45"><td class="memItemLeft" align="right" valign="top">unsigned int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_tree_construction.html#a4631c3ae5ba78df8b954963e4be22e45">m_maxDepth</a></td></tr>
<tr class="memdesc:a4631c3ae5ba78df8b954963e4be22e45"><td class="mdescLeft">&#160;</td><td class="mdescRight">maximum depth of the tree  <br /></td></tr>
<tr class="separator:a4631c3ae5ba78df8b954963e4be22e45"><td class="memSeparator" colspan="2">&#160;</td></tr>
<tr class="memitem:a46b8dd6388568e3e101435c8cdf0efd4" id="r_a46b8dd6388568e3e101435c8cdf0efd4"><td class="memItemLeft" align="right" valign="top">unsigned int&#160;</td><td class="memItemRight" valign="bottom"><a class="el" href="classshark_1_1_tree_construction.html#a46b8dd6388568e3e101435c8cdf0efd4">m_maxBucketSize</a></td></tr>
<tr class="memdesc:a46b8dd6388568e3e101435c8cdf0efd4"><td class="mdescLeft">&#160;</td><td class="mdescRight">maximum "size" of a leaf node  <br /></td></tr>
<tr class="separator:a46b8dd6388568e3e101435c8cdf0efd4"><td class="memSeparator" colspan="2">&#160;</td></tr>
</table>
<a name="details" id="details"></a><h2 class="groupheader">Detailed Description</h2>
<div class="textblock"><p>Stopping criteria for tree construction. </p>
<dl class="section user"><dt></dt><dd>Conditions for automatic tree construction. The data structure allows to specify a maximum bucket size (number of instances represented by a leaf), and a maximum tree depth.</dd></dl>
<dl class="section user"><dt></dt><dd>Note: If a data instance appears more often in a dataset than specified by the maximum bucket size then this condition will be violated; this is because a space partitioning tree has no means of separating a single point. </dd></dl>

<p class="definition">Definition at line <a class="el" href="_binary_tree_8h_source.html#l00073">73</a> of file <a class="el" href="_binary_tree_8h_source.html">BinaryTree.h</a>.</p>
</div><h2 class="groupheader">Constructor &amp; Destructor Documentation</h2>
<a id="a59a1339479147eec5ea8c780a4cf6ddc" name="a59a1339479147eec5ea8c780a4cf6ddc"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a59a1339479147eec5ea8c780a4cf6ddc">&#9670;&#160;</a></span>TreeConstruction() <span class="overload">[1/3]</span></h2>

<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">shark::TreeConstruction::TreeConstruction </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Default constructor: only stop at trivial leaves. </p>

<p class="definition">Definition at line <a class="el" href="_binary_tree_8h_source.html#l00077">77</a> of file <a class="el" href="_binary_tree_8h_source.html">BinaryTree.h</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_tree_construction.html#aa76f09fabb33889421b6c8f2771afb8a">nextDepthLevel()</a>.</p>

</div>
</div>
<a id="ab58da7392a7140a4a51302ab34815172" name="ab58da7392a7140a4a51302ab34815172"></a>
<h2 class="memtitle"><span class="permalink"><a href="#ab58da7392a7140a4a51302ab34815172">&#9670;&#160;</a></span>TreeConstruction() <span class="overload">[2/3]</span></h2>

<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">shark::TreeConstruction::TreeConstruction </td>
          <td>(</td>
          <td class="paramtype"><a class="el" href="classshark_1_1_tree_construction.html">TreeConstruction</a> const &amp;&#160;</td>
          <td class="paramname"><em>other</em></td><td>)</td>
          <td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Copy constructor. </p>

<p class="definition">Definition at line <a class="el" href="_binary_tree_8h_source.html#l00083">83</a> of file <a class="el" href="_binary_tree_8h_source.html">BinaryTree.h</a>.</p>

</div>
</div>
<a id="adbbd4f3b18ceca7fa693f166a3066daf" name="adbbd4f3b18ceca7fa693f166a3066daf"></a>
<h2 class="memtitle"><span class="permalink"><a href="#adbbd4f3b18ceca7fa693f166a3066daf">&#9670;&#160;</a></span>TreeConstruction() <span class="overload">[3/3]</span></h2>

<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">shark::TreeConstruction::TreeConstruction </td>
          <td>(</td>
          <td class="paramtype">unsigned int&#160;</td>
          <td class="paramname"><em>maxDepth</em>, </td>
        </tr>
        <tr>
          <td class="paramkey"></td>
          <td></td>
          <td class="paramtype">unsigned int&#160;</td>
          <td class="paramname"><em>maxBucketSize</em>&#160;</td>
        </tr>
        <tr>
          <td></td>
          <td>)</td>
          <td></td><td></td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>Constructor. </p>
<dl class="params"><dt>Parameters</dt><dd>
  <table class="params">
    <tr><td class="paramname">maxDepth</td><td>stop as soon as the given tree depth is reached (zero means unrestricted) </td></tr>
    <tr><td class="paramname">maxBucketSize</td><td>stop as soon as a node holds at most the bucket size of data points (zero means unrestricted) </td></tr>
  </table>
  </dd>
</dl>

<p class="definition">Definition at line <a class="el" href="_binary_tree_8h_source.html#l00092">92</a> of file <a class="el" href="_binary_tree_8h_source.html">BinaryTree.h</a>.</p>

</div>
</div>
<h2 class="groupheader">Member Function Documentation</h2>
<a id="aa1b255097aa1e7101783b1300b921aad" name="aa1b255097aa1e7101783b1300b921aad"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa1b255097aa1e7101783b1300b921aad">&#9670;&#160;</a></span>maxBucketSize()</h2>

<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">unsigned int shark::TreeConstruction::maxBucketSize </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td> const</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>return maximum "size" of a leaf node </p>

<p class="definition">Definition at line <a class="el" href="_binary_tree_8h_source.html#l00108">108</a> of file <a class="el" href="_binary_tree_8h_source.html">BinaryTree.h</a>.</p>

<p class="reference">References <a class="el" href="classshark_1_1_tree_construction.html#a46b8dd6388568e3e101435c8cdf0efd4">m_maxBucketSize</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_k_d_tree.html#a7ca41c2db8a6d814deef326dd0bbfa44">shark::KDTree&lt; InputT &gt;::buildTree()</a>, <a class="el" href="classshark_1_1_k_h_c_tree.html#a96ac23e4df78cfa576aae64ba7600b97">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::buildTree()</a>, and <a class="el" href="classshark_1_1_l_c_tree.html#a24332e2c05b6a959b8f98577f83ab88a">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::buildTree()</a>.</p>

</div>
</div>
<a id="abb2b42865b60ddf110e4915ab6457373" name="abb2b42865b60ddf110e4915ab6457373"></a>
<h2 class="memtitle"><span class="permalink"><a href="#abb2b42865b60ddf110e4915ab6457373">&#9670;&#160;</a></span>maxDepth()</h2>

<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">unsigned int shark::TreeConstruction::maxDepth </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td> const</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>return maximum depth of the tree </p>

<p class="definition">Definition at line <a class="el" href="_binary_tree_8h_source.html#l00104">104</a> of file <a class="el" href="_binary_tree_8h_source.html">BinaryTree.h</a>.</p>

<p class="reference">References <a class="el" href="classshark_1_1_tree_construction.html#a4631c3ae5ba78df8b954963e4be22e45">m_maxDepth</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_k_d_tree.html#a7ca41c2db8a6d814deef326dd0bbfa44">shark::KDTree&lt; InputT &gt;::buildTree()</a>, <a class="el" href="classshark_1_1_k_h_c_tree.html#a96ac23e4df78cfa576aae64ba7600b97">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::buildTree()</a>, and <a class="el" href="classshark_1_1_l_c_tree.html#a24332e2c05b6a959b8f98577f83ab88a">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::buildTree()</a>.</p>

</div>
</div>
<a id="aa76f09fabb33889421b6c8f2771afb8a" name="aa76f09fabb33889421b6c8f2771afb8a"></a>
<h2 class="memtitle"><span class="permalink"><a href="#aa76f09fabb33889421b6c8f2771afb8a">&#9670;&#160;</a></span>nextDepthLevel()</h2>

<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname"><a class="el" href="classshark_1_1_tree_construction.html">TreeConstruction</a> shark::TreeConstruction::nextDepthLevel </td>
          <td>(</td>
          <td class="paramname"></td><td>)</td>
          <td> const</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">inline</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>return a <a class="el" href="classshark_1_1_tree_construction.html" title="Stopping criteria for tree construction.">TreeConstruction</a> object with maxDepth reduced by one </p>

<p class="definition">Definition at line <a class="el" href="_binary_tree_8h_source.html#l00099">99</a> of file <a class="el" href="_binary_tree_8h_source.html">BinaryTree.h</a>.</p>

<p class="reference">References <a class="el" href="classshark_1_1_tree_construction.html#a46b8dd6388568e3e101435c8cdf0efd4">m_maxBucketSize</a>, <a class="el" href="classshark_1_1_tree_construction.html#a4631c3ae5ba78df8b954963e4be22e45">m_maxDepth</a>, and <a class="el" href="classshark_1_1_tree_construction.html#a59a1339479147eec5ea8c780a4cf6ddc">TreeConstruction()</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_k_d_tree.html#a7ca41c2db8a6d814deef326dd0bbfa44">shark::KDTree&lt; InputT &gt;::buildTree()</a>, <a class="el" href="classshark_1_1_k_h_c_tree.html#a96ac23e4df78cfa576aae64ba7600b97">shark::KHCTree&lt; Container, CuttingAccuracy &gt;::buildTree()</a>, and <a class="el" href="classshark_1_1_l_c_tree.html#a24332e2c05b6a959b8f98577f83ab88a">shark::LCTree&lt; VectorType, CuttingAccuracy &gt;::buildTree()</a>.</p>

</div>
</div>
<h2 class="groupheader">Member Data Documentation</h2>
<a id="a46b8dd6388568e3e101435c8cdf0efd4" name="a46b8dd6388568e3e101435c8cdf0efd4"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a46b8dd6388568e3e101435c8cdf0efd4">&#9670;&#160;</a></span>m_maxBucketSize</h2>

<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">unsigned int shark::TreeConstruction::m_maxBucketSize</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>maximum "size" of a leaf node </p>

<p class="definition">Definition at line <a class="el" href="_binary_tree_8h_source.html#l00116">116</a> of file <a class="el" href="_binary_tree_8h_source.html">BinaryTree.h</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_tree_construction.html#aa1b255097aa1e7101783b1300b921aad">maxBucketSize()</a>, and <a class="el" href="classshark_1_1_tree_construction.html#aa76f09fabb33889421b6c8f2771afb8a">nextDepthLevel()</a>.</p>

</div>
</div>
<a id="a4631c3ae5ba78df8b954963e4be22e45" name="a4631c3ae5ba78df8b954963e4be22e45"></a>
<h2 class="memtitle"><span class="permalink"><a href="#a4631c3ae5ba78df8b954963e4be22e45">&#9670;&#160;</a></span>m_maxDepth</h2>

<div class="memitem">
<div class="memproto">
<table class="mlabels">
  <tr>
  <td class="mlabels-left">
      <table class="memname">
        <tr>
          <td class="memname">unsigned int shark::TreeConstruction::m_maxDepth</td>
        </tr>
      </table>
  </td>
  <td class="mlabels-right">
<span class="mlabels"><span class="mlabel">protected</span></span>  </td>
  </tr>
</table>
</div><div class="memdoc">

<p>maximum depth of the tree </p>

<p class="definition">Definition at line <a class="el" href="_binary_tree_8h_source.html#l00113">113</a> of file <a class="el" href="_binary_tree_8h_source.html">BinaryTree.h</a>.</p>

<p class="reference">Referenced by <a class="el" href="classshark_1_1_tree_construction.html#abb2b42865b60ddf110e4915ab6457373">maxDepth()</a>, and <a class="el" href="classshark_1_1_tree_construction.html#aa76f09fabb33889421b6c8f2771afb8a">nextDepthLevel()</a>.</p>

</div>
</div>
<hr/>The documentation for this class was generated from the following file:<ul>
<li>include/shark/Models/Trees/<a class="el" href="_binary_tree_8h_source.html">BinaryTree.h</a></li>
</ul>
</div><!-- contents -->
</div>
</body>
</html>
